Classical Travelling Salesman Problem (TSP) based Approach to Solve Fuzzy TSP using Yager’s Ranking
نویسندگان
چکیده
Bellman RE, Zadeh LA . 1970. Decision-making in a fuzzy environment, Manage. Sci. , 17: 141-164. Hannan EL 1981. Linear programming with multiple fuzzy goals. Fuzzy Sets Syst. , 6: 235-248 Hansen MP 2000. Use of substitute Scalarizing Functions to guide Local Search based Heuristics: The case of MOTSP, J. Heuristics, 6: 419-431 Jaszkiewicz A 2002. Genetic Local Search for Multiple Objectives Combinatorial
منابع مشابه
A CONSTRAINED SOLID TSP IN FUZZY ENVIRONMENT: TWO HEURISTIC APPROACHES
A solid travelling salesman problem (STSP) is a travelling salesman problem (TSP) where the salesman visits all the cities only once in his tour using dierent conveyances to travel from one city to another. Costs and environmental eect factors for travelling between the cities using dierent conveyances are dierent. Goal of the problem is to nd a complete tour with minimum cost that damages the ...
متن کاملA hybrid metaheuristic using fuzzy greedy search operator for combinatorial optimization with specific reference to the travelling salesman problem
We describe a hybrid meta-heuristic algorithm for combinatorial optimization problems with a specific reference to the travelling salesman problem (TSP). The method is a combination of a genetic algorithm (GA) and greedy randomized adaptive search procedure (GRASP). A new adaptive fuzzy a greedy search operator is developed for this hybrid method. Computational experiments using a wide range of...
متن کاملA Study of Genetic Algorithm to Solve Travelling Salesman Problem
This paper presents the literature survey review of Travelling Salesman Problem (TSP). TSP belongs to the category of NP-hard problems. A various number of methods have been designed to solve this problem. Genetic Algorithm is one of the best methods which is used to solve various NP-hard problem such as TSP. The natural evolution process is always used by genetic Algorithm to solve the problem...
متن کاملAnt Colony Component-based System for Traveling Salesman Problem
A component-based approach to model Ant Colony System (ACS) for the Traveling Salesman Problem (TSP) is shown in this paper. The used components to solve the TSP with ACS technique and the collaboration rules between components are also described. The internal reasoning about the ant colony component-based system for the TSP gives a better perception of solving this problem using ant-based tech...
متن کاملSolving TSP Using Various Meta-Heuristic Algorithms
Real world problems like Travelling Salesman Problem (TSP) belong to NP-hard optimization problems which are difficult to solve using classical mathematical methods. Therefore, many alternate solutions have been developed to find the optimal solution in shortest possible time. Nature-inspired algorithms are one of the proposed solutions which are successful in finding the solutions that are ver...
متن کامل